منابع مشابه
Diagonal and Toroidal Mesh Networks
Ah&z&-Diagonal and toroidal mesh are degree-4, point to point intercoimection models suitable for connecting communication elements in parallel computers, particularly multicomputers. The two networks have a similar structure. The toroidai mesh is popular and well-studied whereas tbe diagonal mesh is relatively new. In this paper, we show that the diagonal mesh has a smaller diameter and a larg...
متن کاملSimulation Of Diagonal Data Replication In Mesh
In a large dynamic network, data can be copied anywhere to make it fault tolerant and easy accessed but there must be an efficient protocol to manage the replicas and make sure the data is consistent and high in availability with a low communication cost. In this paper, we introduced a new protocol, named Diagonal Replication in Mesh (DRM) for data replica control protocol for a large dynamic n...
متن کاملConvolution on Mesh Connected Multicomputers
Convolution is an important primitive in computer vision and image processing. In this paper, we present an efficient algorithm for convolution on a mesh connected computer with wraparound. Our algorithm does not require a broadcast feature for data values as assumed by previously proposed algorithms. As a result, the algorithm is applicable both to SIMD as well as MIMD meshes. For an N×N image...
متن کاملFFTs on Mesh Connected Computers
The most eeective use of mesh connected computers is achieved by paying careful attention to the organization of the storage and movement of data. For an important class of algorithms the formalization of the different operations they perform lead to an uniied treatment for them and may result in important simpliications. In this work we apply this point of view to the Fast Fourier Transform (F...
متن کاملConnected components algorithms for mesh-connected parallel computers
We present a new CREW PRAM algorithm for nding connected components. For a graphG with n vertices andm edges, algorithmA0 requires at mostO(logn) parallel steps and performsO((n+m) logn) work in the worst case. The advantage our algorithm has over others in the literature is that it can be adapted to a 2-D mesh-connected communication model in which all CREW operations are replaced byO(logn) pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indian Journal of Science and Technology
سال: 2016
ISSN: 0974-5645,0974-6846
DOI: 10.17485/ijst/2016/v9i32/100219